Quantum complexity theory

Results: 258



#Item
41What can be computed without communications? Heger Arfaoui and

What can be computed without communications? Heger Arfaoui and

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2012-04-26 12:02:48
42Microsoft Word - D-wave August 14th

Microsoft Word - D-wave August 14th

Add to Reading List

Source URL: www.kcpl.ca

Language: English - Date: 2013-06-03 14:34:10
43Quantum computing and polynomial equations over the finite field Z2 Christopher M. Dawson,1, 2, ∗ Henry L. Haselgrove,1, 3, † Andrew P. Hines,1, 2, ‡ Duncan Mortimer,1, 2, § Michael A. Nielsen,1, 4, ¶ and Tobias

Quantum computing and polynomial equations over the finite field Z2 Christopher M. Dawson,1, 2, ∗ Henry L. Haselgrove,1, 3, † Andrew P. Hines,1, 2, ‡ Duncan Mortimer,1, 2, § Michael A. Nielsen,1, 4, ¶ and Tobias

Add to Reading List

Source URL: arxiv.org

Language: English
44PHYSICAL REVIEW B 82, 104522 共2010兲  Analysis of a tunable coupler for superconducting phase qubits Ricardo A. Pinto and Alexander N. Korotkov* Department of Electrical Engineering, University of California, Riversid

PHYSICAL REVIEW B 82, 104522 共2010兲 Analysis of a tunable coupler for superconducting phase qubits Ricardo A. Pinto and Alexander N. Korotkov* Department of Electrical Engineering, University of California, Riversid

Add to Reading List

Source URL: www.physast.uga.edu

Language: English - Date: 2010-12-15 11:27:20
45A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora

A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2010-07-11 20:15:23
46Using Relevance Queries for Identification of Read-Once Functions

Using Relevance Queries for Identification of Read-Once Functions

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2013-02-16 12:55:16
47The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2011-11-17 23:45:06
48Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy

Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:24:53
49Structural Complexity of Vortex Flows by Diagram Analysis and Knot Polynomials Renzo L. Ricca  Abstract In this paper I present and discuss with examples new techniques based

Structural Complexity of Vortex Flows by Diagram Analysis and Knot Polynomials Renzo L. Ricca Abstract In this paper I present and discuss with examples new techniques based

Add to Reading List

Source URL: www.matapp.unimib.it

Language: English - Date: 2014-06-22 16:43:35
50Launchpad_logo_color_orange

Launchpad_logo_color_orange

Add to Reading List

Source URL: craftevents.com.au

Language: English - Date: 2015-02-23 01:22:44